Nowhere-Zero 3-Flows in Squares of Graphs
نویسندگان
چکیده
It was conjectured by Tutte that every 4-edge-connected graph admits a nowherezero 3-flow. In this paper, we give a complete characterization of graphs whose squares admit nowhere-zero 3-flows and thus confirm Tutte’s 3-flow conjecture for the family of squares of graphs.
منابع مشابه
Forbidden graphs and group connectivity
Many researchers have devoted themselves to the study of nowhere-zero flows and group connectivity. Recently, Thomassen confirmed the weak 3-flow conjecture, which was further improved by Lovász, Thomassen, Wu and Zhang who proved that every 6-edge-connected graph is Z3-connected. However, Conjectures 1 and 2 are still open. Conjecture 2 implies Conjecture 1 by a result of Kochol that reduces C...
متن کاملInside-Out Polytopes
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an integer whose parts are partially distinct, and generalized latin squares. Our method is to generalize Ehrhart’s theory of lattice-point counting to a convex pol...
متن کاملNowhere-zero 3-flows in abelian Cayley graphs
We characterize Cayley graphs of abelian groupswhich admit a nowhere-zero 3-flow. In particular, we prove that every k-valent Cayley graph of an abelian group, where k 4, admits a nowhere-zero
متن کاملNowhere-zero 3-flows in triangularly connected graphs
Let H1 and H2 be two subgraphs of a graph G. We say that G is the 2-sum of H1 and H2, denoted by H1 ⊕2 H2, if E(H1)∪E(H2)=E(G), |V (H1)∩ V (H2)| = 2, and |E(H1)∩E(H2)| = 1. A triangle-path in a graph G is a sequence of distinct triangles T1T2 · · ·Tm in G such that for 1 i m − 1, |E(Ti) ∩ E(Ti+1)| = 1 and E(Ti) ∩ E(Tj ) = ∅ if j > i + 1. A connected graph G is triangularly connected if for any ...
متن کاملCubic Graphs without a Petersen Minor Have Nowhere–zero 5–flows
We show that every bridgeless cubic graph without a Petersen minor has a nowhere-zero 5-flow. This approximates the known 4-flow conjecture of Tutte. A graph has a nowhere-zero k-flow if its edges can be oriented and assigned nonzero elements of the group Zk so that the sum of the incoming values equals the sum of the outcoming ones for every vertex of the graph. An equivalent definition we get...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003